A simple heuristic for perishable item inventory control under non-stationary stochastic demand
نویسندگان
چکیده
منابع مشابه
Periodic Review for a Perishable Item under Non Stationary Stochastic Demand
We consider the periodic-review, single-location, single-product, production/inventory control problem under non stationary demand and service-level constraints. The product is perishable and has a fixed shelf life. Costs comprise fixed ordering costs and inventory holding costs. For this inventory system we discuss a number of control policies that may be adopted. For one of these policies, we...
متن کاملInventory control for a perishable product with non-stationary demand and service level constraints
We study the practical production planning problem of a food producer facing a non-stationary erratic demand for a perishable product with a fixed life time. In meeting the uncertain demand, the food producer uses a FIFO issuing policy. The food producer aims at meeting a certain service level at lowest cost. Every production run a set-up cost is incurred. Moreover, the producer has to deal wit...
متن کاملOn Computing Order Quantities for Perishable Inventory Control with Non-stationary Demand
We study the global optimal solution for a planning problem of inventory control of perishable products and non-stationary demand.
متن کاملA Research on Non-Stationary Stochastic Demand Inventory Systems
Non-stationary stochastic lot sizing problem appears in many industrial environments where demand is nonstationary and stochastic, and replenishments require fixed freight fees. This paper presents the cost performance assessment of three inventory control strategies proposed for the stochastic lot sizing problem, namely Hua et al. (2008)’s strategy (HYHX), Tarim and Kingsman (2006)’s model (TK...
متن کاملA Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand
The single-item stochastic inventory control problem is to find an inventory replenishment policy in the presence of independent discrete stochastic demands under periodic review and finite time horizon. In this paper, we prove that this problem is intractable and for any 2 > 0, we design an algorithm with running time polynomial in the size of the problem input and in 1/2, that finds a policy ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Production Research
سال: 2016
ISSN: 0020-7543,1366-588X
DOI: 10.1080/00207543.2016.1193248